Frege Structures for Partial Applicative Theories
نویسنده
چکیده
Due to strictness problems, usually the syntactical definition of Frege structures is conceived as a truth theory for total applicative theories. To investigate Frege structures in a partial framework we can follow two ways. First, simply by ignoring undefinedness in the truth definition. Second, by introducing of a certain notion of pointer. Both approaches are compatible with the traditional formalizations of Frege structures and preserve the main results, namely abstraction and the proof-theoretic strength.
منابع مشابه
Truth in Applicative Theories
We give a survey on truth theories for applicative theories. It comprises Frege structures, Universes for Frege structures, and a theory of supervaluation. We present the proof-theoretic results for these theories and show their syntactical expressive power. In particular, we present as a novelty a syntactical interpretation of ID1 in a applicative truth theory based on supervaluation.
متن کاملApplicative Theories and Explicit Mathematics
[5] Solomon Feferman and Gerhard Jäger. Systems of explicit mathematics with non-constructive µ-operator. [6] Solomon Feferman and Gerhard Jäger. Systems of explicit mathematics with non-constructive µ-operator. [9] Susumu Hayashi and Satoshi Kobayashi. A new formulation of Feferman's system of functions and classes and its relation to Frege structures.
متن کاملEffective Applicative Structures
An Effective Applicative Structure is a collection of partial functions over an arbitrary set M, indexed by elements of the same set, closed under composition, and containing projections, universal functions and functions S n of the s-m-n theorem of Recursion Theory. The notion of EAS is developed as an abstract approach to computability, filling a notational gap between functional and combinat...
متن کاملTypability in Partial Applicative Structures
Adapting a claim of Kracht (Theor Comput Sci 354:131–141, 2006), we establish a characterization of the typable partial applicative structures.
متن کاملCoinductive characterizations of applicative structures
We discuss new ways of characterizing, as maximal xed points of monotone operators, observational congruences on-terms and, more in general, equivalences on applicative structures. These characterizations naturally induce new forms of coinduction principles, for reasoning on program equivalences, which are not based on Abramsky's applicative bisimulation. We discuss in particular, what we call,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Log. Comput.
دوره 9 شماره
صفحات -
تاریخ انتشار 1999